On the metric s-t path Traveling Salesman Problem

We study the metric s-t path Traveling Salesman Problem (TSP). [An, Kleinberg, and Shmoys, STOC 2012] improved on the long standing 5 3 -approximation factor and presented an algorithm that achieves an approximation factor of 1+ √ 5 2 ≈ 1.61803. Later [Sebő, IPCO 2013] further improved the approximation factor to 85 . We present a simple, self-contained analysis that unifies both results; our main contribution is a unified correction vector. Additionally, we compare two different linear programming (LP) relaxations of the s-t path TSP, namely, the path version of the Held-Karp LP relaxation for TSP and a weaker LP relaxation, and we show that both LPs have the same (fractional) optimal value. Also, we show that the minimum cost of integral solutions of the two LPs are within a factor of 3 2 of each other. Furthermore, we prove that a half-integral solution of the stronger LP-relaxation of cost c can be rounded to an integral solution of cost at most 3 2c. Finally, we give an instance that presents obstructions to two natural methods that aim for an approximation factor of 32 .